Low complexity distance metrics for maximum likelihood receivers

ABSTRACT

Systems and methods are provided for determining a data value for a bit of interest in a received data signal. A closest 0-bit symbol candidate is selected from a plurality of 0-bit symbol candidates using a symbol selection distance approximation. A closest 1-bit symbol candidate is selected from a plurality of 1-bit symbol candidates using the symbol selection distance approximation. A 0-bit distance between the received data signal and the selected 0-bit symbol candidate is determined, and a 1-bit distance between the received data signal and the selected 1-bit symbol candidate is determined. A log likelihood ratio is calculated for the bit of interest using the determined 0-bit distance and the determined 1-bit distance.

CROSS-REFERENCE TO RELATED APPLICATIONS

This disclosure claims priority from U.S. Provisional Patent Application No. 61/419,184, filed on Dec. 2, 2010, the entirety of which is incorporated herein by reference.

This disclosure is related to U.S. patent application Ser. No. 12/406,587, filed on Mar. 18, 2009, the entirety of which is incorporated herein by reference.

FIELD

The technology described in this patent document relates generally to signal receivers, and more particularly to likelihood ratio computation in signal receivers.

BACKGROUND

Multiple transmit/multiple receive (MIMO) antennas may be used to enhance communication data rates in standards that allow more than one spatial stream to be transmitted, such as WLAN (IEEE 802.11n), WiMax (IEEE 802.16e), 3GPP LTE, etc. FIG. 1 is a block diagram 30 of a two spatial stream transmitter configuration example. Transmit data 32 is provided as a stream of 1's and 0's to an encoder 34. The encoder 34 encodes the transmit data 32 with, for example, an error correcting code. The output of the encoder 34 is provided to a spatial stream splitter 36, which divides the bit stream from the encoder 34 into two spatial streams in some order. The two spatial streams are then propagated to a frequency modulator 38 which modulates the streams into symbols, which may be represented as a sequence of complex numbers. The frequency modulated signals are sent through a transmission channel, such as through the air, via one or more antennas 40.

Efficient detection/equalization of the transmitted signals is central to a MIMO receiver. FIG. 2 is a block diagram of a two spatial stream receiver configuration example. Multiple spatial stream signals are received, such as via one or more antennas 52, from the transmission channel. The received multiple spatial stream signals may be represented by the equation: y_(k)=H_(Hk)+w, where y_(k) represents an N×1 vector of received signals over N receive antennas at time k, H is a complex-valued N×2 matrix that represents a channel matrix identifying the combined effects of the transmission channel and spatial mapping of the transmitter on the transmitted signal, x_(k) is an 2×1 vector that represents the transmitted data values that are sought to be recovered, and w represents noise. The above relationship pertains to a single frequency in a frequency-flat fading single-carrier modulated system or, alternatively, applies to individual frequency subcarriers or tones in an orthogonal frequency division multiplexing (OFDM) or similarly modulated system. The received multiple spatial streams are propagated to an equalizer/receiver 54 which calculates log-likelihood ratios (LLR(1) and LLR(2)) for each of the received spatial streams. The calculated log-likelihood ratios are ordered and combined by a log-likelihood ratio combiner 56 and made available to a decoder 58. The decoder 58 decodes the data received from the combiner 56 and generates output data 60.

In a two spatial stream system, each data symbol received, x_(i), where i=1 corresponds to data transmitted on a first spatial stream, and i=2 corresponds to data transmitted on a second spatial stream, maps to n bits {b₁ ^((i)), b₂ ^((i)), . . . , b_(n) ^((i))}. M=2^(n) is the alphabet size of the underlying modulation, such as binary phase shift keying (BPSK), quadrature amplitude modulation (QAM), etc., and the set of all possible scalar constellation points may be represented by A. The log-likelihood ratio (LLR) for a bit b_(k) ^((i)) given a received vector y and a known channel matrix H may be represented as:

${{L\left( b_{k}^{(i)} \right)} = {{\log\frac{P\left( {b_{k}^{(i)} = 1} \right)}{P\left( {b_{k}^{(i)} = 0} \right)}} = {\log\left\{ {\left( {\sum\limits_{x \in x_{k,i}}{\mathbb{e}}^{{{- {{y - {Hx}}}^{2}}/2}\sigma^{2}}} \right)/\left( {\sum\limits_{x \in {\overset{\sim}{x}}_{k,i}}{\mathbb{e}}^{{{- {{y - {Hx}}}^{2}}/2}\sigma^{2}}} \right)} \right\}}}},$ where x_(k,i) is the set of all possible x vectors with b_(k) ^((i))=1, and x _(k,i) is the set of all possible x vectors with b_(k) ^((i))=0. In practice, the following simplification, called the Max-Log Approximation, is utilized:

${L\left( b_{k}^{(i)} \right)} \approx {{\min\limits_{x \in x_{k,i}}{{y - {Hx}}}^{2}} - {\min\limits_{x \in {\overset{\sim}{x}}_{k,i}}{{{y - {Hx}}}^{2}.}}}$

There are several existing systems for detecting/equalizing received signals in multiple spatial stream systems. FIG. 3A is a block diagram 70 of a log-likelihood ratio calculator 72 that utilizes a linear equalizer 74. The linear equalizer 74 receives, via one or more antennas 76, a multi-spatial stream signal that has been transmitted through a channel and outputs a stream of log-likelihood ratios based on the received signals. For example, a zero-forcing equalizer is a linear equalizer that may be utilized, as illustrated in FIG. 3A. The zero-forcing equalizer seeks to recover the transmitted data values, x_(k), from the received signal, y_(k), that are modeled as, y_(k)=H_(Xk)+w, by assuming the noise vector is zero. Having an estimated channel effect matrix, H, enables x_(k) to be recovered from the received signal, y_(k), as the data values are the only unknown remaining. While the zero-forcing equalizer has a simple design, not taking the noise term into consideration makes the method sub-optimal.

FIG. 3B is a block diagram 80 of a log-likelihood ratio calculator 82 that utilizes a maximum-likelihood receiver 84. The maximum-likelihood receiver 84 receives a multi-spatial signal that has been transmitted through a channel, such as through the air, via one or more antennas 86, and outputs a stream of log-likelihood ratios based on the received signals. The maximum-likelihood receiver 84 is superior to most linear equalizers in error performance. However, maximum-likelihood receivers tend to be highly complex, such as having a complexity that grows exponentially with the number of spatial streams associated with the system.

FIG. 4A is a block diagram 100 of a maximum-likelihood receiver 102 that utilizes an exhaustive search methodology 104. The exhaustive search module 104 receives, via one or more antennas 106, a multi-spatial signal that has been transmitted through a channel and outputs a stream of log-likelihood ratios based on the received signals. In the exhaustive search methodology 104, the maximum likelihood receiver computes ∥y−Hx∥² for all possible values of x. In a two spatial stream system, this results in M² total distance computations. The maximum-likelihood receiver then computes log-likelihood ratios accordingly.

FIG. 4B is a diagram illustrating exemplary calculations for the exhaustive search methodology in a QPSK, 2-spatial-stream setting. A real/imaginary plot of a received signal is shown at 112. The exhaustive search methodology calculates the distance term, ∥y−Hx∥², for each of the constellation points. FIG. 4B illustrates only six of the distance calculations 114 to six of the constellation points 116 for ease in viewing. However, the exhaustive search method would process distance calculations for all of the 16 constellation points resulting in 16 distance terms to be considered in calculating an LLR. This problem is further exacerbated in popular, more complex encoding schemes such as 16-QAM, which would require 256 distance calculations with 256 distance terms to be considered in calculating an LLR. This order M², O(M²), complexity may introduce a significant bottleneck into the receiver system.

FIG. 5A is a block diagram 120 of a maximum-likelihood receiver 122 that utilizes a sphere decoding simplification 124. The sphere decoding methodology 124 receives a multi-spatial signal that has been transmitted through a channel, such as through the air, via one or more antennas 126, and outputs a stream of log-likelihood ratios based on the received signals. The sphere decoding methodology 124 seeks to simplify the complexity of the exhaustive search by limiting the amount of constellation points to which distance calculations are made and, consequently, the number of distance terms to be considered in calculating an LLR. FIG. 5B is a diagram 130 illustrating the sphere decoding simplification. In the sphere decoding technique, distance values, ∥y−Hx∥², are only computed for those x such that Hx lies inside a sphere of radius D centered around the received signal, y (i.e., for x such that ∥y−Hx∥²≦D²). A real/imaginary plot of a received signal is shown at 132. As illustrated in FIG. 5B, the limitation of distance calculations 136 to constellation points 138 within a radius D 134 reduces the number of distance calculations and terms to be considered in LLR calculation to four. While this simplification may offer significant processing savings, it may have a detrimental effect on error performance. Because the set of constellation points 138 within radius D may not have constituent 1s and 0s at every bit location, as is evident in the first bit position where all four constellation points 138 contain ‘0's at the first position, the LLR calculation formulas described above may have insufficient data to correctly calculate an LLR (e.g., the Max Log Approximation would not have any terms in x∈x_(k,i) from which to select a minimum).

SUMMARY

In accordance with the teachings provided herein, systems and methods are provided for determining a data value for a bit of interest in a received data signal. A closest 0-bit symbol candidate is selected from a plurality of 0-bit symbol candidates using a symbol selection distance approximation. Selecting a closest 0-bit symbol candidate includes determining a first distance between a received data signal and each of the plurality of 0-bit symbol candidates, where the first distance is determined using the symbol selection distance approximation and selecting one of the 0-bit symbol candidates based on the determined first distances. A closest 1-bit symbol candidate is selected from a plurality of 1-bit symbol candidates using the symbol selection distance approximation. Selecting a closest 1-bit symbol candidate includes determining a second distance between the received data signal and each of the plurality of 1-bit symbol candidates, where the second distance is determined using the symbol selection distance approximation and selecting one of the 1-bit symbol candidates based on the determined second distances. A 0-bit distance is determined between the received data signal and the selected 0-bit symbol candidate, and a 1-bit distance between the received data signal and the selected 1-bit symbol candidate determined. A log likelihood ratio for the bit of interest is calculated using the determined 0-bit distance and the determined 1-bit distance.

As another example, a computer-implemented system for determining a data value for a bit of interest in a received data signal may include one or more data processors and a computer-readable medium encoded with instructions for commanding the one or more data processors to execute a method. In the method, a closest 0-bit symbol candidate is selected from a plurality of 0-bit symbol candidates using a symbol selection distance approximation. Selecting a closest 0-bit symbol candidate includes determining a first distance between a received data signal and each of the plurality of 0-bit symbol candidates, where the first distance is determined using the symbol selection distance approximation and selecting one of the 0-bit symbol candidates based on the determined first distances. A closest 1-bit symbol candidate is selected from a plurality of 1-bit symbol candidates using the symbol selection distance approximation. Selecting a closest 1-bit symbol candidate includes determining a second distance between the received data signal and each of the plurality of 1-bit symbol candidates, where the second distance is determined using the symbol selection distance approximation and selecting one of the 1-bit symbol candidates based on the determined second distances. A 0-bit distance is determined between the received data signal and the selected 0-bit symbol candidate, and a 1-bit distance between the received data signal and the selected 1-bit symbol candidate determined. A log likelihood ratio for the bit of interest is calculated using the determined 0-bit distance and the determined 1-bit distance.

As a further example, a computer-readable medium is encoded with instructions for commanding one or more data processors to execute a method for determining a data value for a bit of interest in a received data signal. In the method, a closest 0-bit symbol candidate is selected from a plurality of 0-bit symbol candidates using a symbol selection distance approximation. Selecting a closest 0-bit symbol candidate includes determining a first distance between a received data signal and each of the plurality of 0-bit symbol candidates, where the first distance is determined using the symbol selection distance approximation and selecting one of the 0-bit symbol candidates based on the determined first distances. A closest 1-bit symbol candidate is selected from a plurality of 1-bit symbol candidates using the symbol selection distance approximation. Selecting a closest 1-bit symbol candidate includes determining a second distance between the received data signal and each of the plurality of 1-bit symbol candidates, where the second distance is determined using the symbol selection distance approximation and selecting one of the 1-bit symbol candidates based on the determined second distances. A 0-bit distance is determined between the received data signal and the selected 0-bit symbol candidate, and a 1-bit distance between the received data signal and the selected 1-bit symbol candidate determined. A log likelihood ratio for the bit of interest is calculated using the determined 0-bit distance and the determined 1-bit distance.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a multiple spatial stream transmitter configuration.

FIG. 2 is a block diagram of a multiple spatial stream receiver configuration.

FIG. 3A is a block diagram of a log-likelihood ratio calculator that utilizes a linear equalizer.

FIG. 3B is a block diagram of a log-likelihood ratio calculator that utilizes a maximum-likelihood receiver.

FIG. 4A is a block diagram of a maximum-likelihood receiver that utilizes an exhaustive search methodology.

FIG. 4B is a diagram illustrating exemplary calculations for the exhaustive search methodology.

FIG. 5A is a block diagram of a maximum-likelihood receiver that utilizes a sphere decoding simplification.

FIG. 5B is a diagram illustrating the sphere decoding simplification.

FIG. 6 is a block diagram depicting a maximum likelihood receiver that implements an expedited search methodology.

FIG. 7 is a diagram depicting exemplary distance calculations made by the expedited search engine.

FIG. 8 is a block diagram depicting a log likelihood ratio calculation by a maximum likelihood receiver.

FIGS. 9A and 9B are block diagrams depicting 0-bit and 1-bit candidate selection by an expedited search engine.

FIG. 10 is a diagram depicting the selection of a 0-bit symbol candidate.

FIG. 11 is a diagram depicting the selection of a 1-bit symbol candidate.

FIG. 12 is a flow diagram depicting an example method for calculating a log likelihood ratio for a bit of interest.

FIGS. 13A, 13B, and 13C depict examples of systems for use in implementing a maximum likelihood receiver.

DETAILED DESCRIPTION

As noted above in discussing FIG. 4A, a maximum-likelihood receiver that implements an exhaustive search methodology tends to become highly complex as the number of spatial streams associated with the system increases. Such complexity may increase exponentially. Because an increased number of spatial streams can have a positive effect on achievable data rates, mitigation of these complexity increases is desirable.

FIG. 6 is a block diagram depicting a maximum likelihood receiver that implements an expedited search methodology. A maximum likelihood receiver 152 receives a data signal via an antenna 154. The received data signal is provided to an expedited search engine 156 as part of a process of determining whether bits transmitted in the received data signal represent 0's or 1's. The expedited search engine 156 executes a modified exhaustive search of all possible symbols that could be portrayed by the received data signal and uses the results of that search to calculate a log likelihood ratio, which can be used to determine whether a particular bit of data in the received data signal should be considered a 0 or a 1.

FIG. 7 is a diagram depicting exemplary distance calculations made by the expedited search engine. A real/imaginary plot of a received signal is shown at 160. The expedited search engine calculates a distance, for each of the constellation points, which represent symbols associated with a series of bit values. FIG. 7 illustrates only eight of the distance calculations 162 for ease in viewing. The distance calculations are made to identify two of the constellation points that are to be used in calculating the log likelihood ratio. The expedited search engine seeks to find the closest symbol candidate having a 0 at the bit of interest and the closest symbol candidate having a 1 at the bit of interest. Thus, when determining whether the first bit of a symbol for a received signal is a 0 or 1, the expedited search engine attempts to identify the closest symbol candidate that has a 0 as its first bit and the closest symbol candidate that has a 1 as its first bit. When determining whether the second bit of a symbol for a received signal is a 0 or 1, the expedited search engine attempts to identify the closest symbol candidate that has a 0 as its second bit and the closest symbol candidate that has a 1 as its second bit.

Traditional exhaustive search methodologies utilize an exact distance solving algorithm (e.g., a squared Euclidean distance calculation) in calculating a distance between the received signal and the symbol candidates. Such an exact distance solving algorithm is computational complex and time consuming. The example of FIG. 7 includes only 16 possible candidate signals, but as the number of available candidate symbols increases, the cost of the exact distance solving algorithm that is calculated for each received signal symbol quickly increases.

To combat the cost of performing an exact distance calculation from the received signal symbol to each of the candidate symbols, the expedited search engine utilizes a symbol selection distance approximation algorithm to calculate the distances 162. By performing a faster, although potentially less accurate distance determination during the search step, performance in identifying and selecting 0-bit symbol candidates and 1-bit symbol candidates can be greatly improved, resulting in faster searches that utilize fewer system resources. If heightened accuracy of the distance measurements for the selected 0-bit symbol candidate and the selected 1-bit symbol candidate is desired, then those two specific distance measurements can be refined after the searching step, as described in further detail below.

FIG. 8 is a block diagram depicting a log likelihood ratio calculation by a maximum likelihood receiver. A received data signal (e.g., from one stream of a multi-stream signal of a single carrier signal) is provided to the expedited search engine 170. At 172, a symbol selection distance approximation is used to select a closest 0-bit symbol candidate from a plurality of 0-bit symbol candidates (e.g., from the constellation of symbols depicted in FIG. 7). At 174, the symbol selection distance approximation is used to select a closest 1-bit symbol candidate from a plurality of 1-bit symbol candidates. Because the log likelihood calculation 176 that is output from the maximum likelihood receiver utilizes computed distances from the received signal to the selected 0-bit candidate and the selected 1-bit candidate, the distances to those selected candidates, which were roughly calculated at 172 and 174 using the symbol selection distance approximation, may be recalculated at 178 and 180, respectively. The calculations at 178 and 180 may be performed using a different symbol selection distance approximation than was used by the expedited search engine 170, or an exact calculation algorithm, such as a squared Euclidean distance calculation, may be used. In some configurations, such as those where sufficient tolerance is present, the distance calculations made at 172 and 174 as part of the search process may be sufficient for the log likelihood calculation 176, and no additional recalculation may be performed at 178 and 180.

At 176, a log likelihood ratio calculation is performed using the distances determined between the received signal and the selected 0-bit candidate and the selected 1-bit candidate. For example, the log likelihood ratio may be calculated according to

${{L\left( b_{k}^{(i)} \right)} \approx {\frac{1}{\sigma^{2}}\left\{ {{{y - {Hx}_{0}}}^{2} - {{y - {Hx}_{1}}}^{2}} \right\}}},$ where ∥y−Hx₀∥ is the 0-bit distance calculated between the received signal and the selected 0-bit candidate, x₀, where

${x_{0} = {\arg\;{\min\limits_{x \in {\overset{\_}{X}}_{k,j}}{{y - {Hx}}}}}},$ and ∥y−Hx₁∥ is the 1-bit distance calculated between the received signal and the selected 1-bit candidate, x₁, where

${x_{1} = {\arg\;{\min\limits_{x \in X_{k,j}}{{y - {Hx}}}}}},$ where L(b_(k) ^((i))) is the log likelihood ratio for a bit of interest, and σ² is the variance of the noise.

FIGS. 9A and 9B are block diagrams depicting 0-bit and 1-bit candidate selection by an expedited search engine. In selecting a closest 0-bit candidate at 180 in FIG. 9A, distances are determined at 182 between a received data signal and each of a plurality of 0-bit symbol candidates (i.e., symbols having a 0 at the current bit for which a log likelihood ratio is being calculated). Based on the distance determinations, the 0-bit candidate that is estimated to be closest to the received signal is selected at 184 for use in a Max-Log Approximation log likelihood ratio calculation.

In selecting a closest 1-bit candidate at 186 in FIG. 9B, distances are determined at 188 between a received data signal and each of a plurality of 1-bit symbol candidates (i.e., symbols having a 1at the current bit for which a log likelihood ratio is being calculated). Based on the distance determinations, the 1-bit candidate that is estimated to be closest to the received signal is selected at 190 for use in a Max-Log Approximation log likelihood ratio calculation.

FIG. 10 is a diagram depicting the selection of a 0-bit symbol candidate. Distance calculations between the received signal 200 and each of the eight symbol candidates having a 0 value for the first bit are made using a symbol selection distance approximation. The 0-bit candidate at 202 is identified by the symbol selection distance approximation as being the closest 0-bit candidate. The distance between the received signal 200 and the selected 0-bit candidate is recalculated, as indicated by the solid arrow at 204, and that recalculated distance is used as an input to the log likelihood ratio calculation.

FIG. 11 is a diagram depicting the selection of a 1-bit symbol candidate. Distance calculations between the received signal 200 and each of the eight symbol candidates having a 1 value for the first bit are made using the symbol selection distance approximation. The 1-bit candidate at 212 is identified by the symbol selection distance approximation as being the closest 1-bit candidate. The distance between the received signal 210 and the selected 1-bit candidate is recalculated, as indicated by the solid arrow at 214, and that recalculated distance is used as an input to the log likelihood ratio calculation.

In configurations where symbols are associated with multiple bits (e.g., the symbols depicted in the constellation of FIG. 7), the distance calculations between the received signal and the candidate symbols made at 182 and 188 in FIG. 9 may be saved for use with subsequent bits of the current symbol. For example, for a second bit of a symbol, the selections at 184 and 190 may be made without repeating the distance determinations at 182 and 188, where the set of 0-bit symbol candidates available for selection at 184 changes based on the bit identity at the second bit for each of the candidate symbols available. Similarly, the set of candidate symbols available for selection at 190 is limited to those having a bit value of 1 for the second bit. However, the distances between the received signal and the candidate symbols do not change.

Distance calculations between the received signal and symbol candidates can be performed in a variety of manners. Exact computations can be computed using an exact squared Euclidean calculation. For example, a squared Euclidean distance, ∥z∥², can be calculated for a complex vector of N dimensions, z=z_(1I)+jz_(1Q), z=z_(2I)+jz_(2Q), z=z_(NI)+jz_(NQ), (e.g., vectors from the received signal to each of the N candidate symbols) according to:

${z}^{2} = {{\sum\limits_{k = 1}^{N}{z_{kI}}^{2}} + {\sum\limits_{k = 1}^{N}{{z_{kQ}}^{2}.}}}$ However, such a calculation over the entire set of candidate symbols is resource and time intensive.

To alleviate the complexity involved with providing exact squared Euclidean difference calculations during the search phase where closest 0-bit and 1-bit candidates are selected, a symbol selection distance approximation may be used during the search phase. For example, certain symbol selection distance approximations utilize a normal approximation for a complex-valued scalar (e.g., representing a vector from a received signal and a candidate symbol), z_(k)=z_(kI)+jz_(kQ), where the norm approximation of ∥z_(k)∥ estimates ∥z_(k)∥=max{|z_(kI)+jz_(kQ)|}+α·min{∥z_(kI)|,|z_(kQ)|}, where α is a constant (e.g., 5/16).

Using the above described norm approximation, a non-iterative distance approximation for ∥z∥ can be calculated as follows. ∥z∥≈G(z), where

${{G(z)} = {\sum\limits_{k = 1}^{N}{g\left( z_{k} \right)}}},$ where g(z _(k))=max{|z _(kI) |,|z _(kQ)|}+α·min{|z _(kI) |,|z _(kQ) |}, k=1 . . . N. The non-iterative distance approximation can be used to provide a fast estimate of distances between the received signal and each of the candidate symbols of interest.

An iterative distance approximation can also be utilized. The iterative distance approximation may provide more accurate results when compared to the non-iterative alternative described above, at the cost of some computational complexity. The non-iterative distance approximation can be calculated according to: ∥z∥≈{hacek over (G)}(z)^((N)), where {hacek over (G)}(z)⁽¹⁾ =g(z ₁), where {hacek over (G)}(z)^((k))=max{g(z _(k)),G(z)^((k−1))}+α·min{g(z _(k)),G(z)^((k−1)) }, k=2 . . . N, where g(z _(k))=max{|z _(kI) |,|z _(kQ)|}+α·min{|z _(kI) |,|z _(kQ) |}, k=1 . . . N.

Upon selection of the 0-bit and 1-bit symbol candidates using the symbol selection distance approximation (e.g., the iterative distance approximation or the non-iterative distance approximation), the distances for the selected symbol candidates may or may not be recalculated. If the distances are not recalculated, then the distance determined during the search phase is used for the log likelihood ratio calculation. If the distances are recalculated, then a different distance approximation may be used, or an exact distance calculation algorithm may be used. Example combinations of search phase symbol selection distance approximation methods and log-likelihood distance calculation sources include:

Search Phase Log-Likelihood Ratio Phase Non-iterative Distance Non-iterative Distance Approximation Approximation Non-iterative Distance Iterative Distance Approximation Approximation Non-iterative Distance Squared Euclidean Distance Approximation Calculation Iterative Distance Iterative Distance Approximation Approximation Iterative Distance Non-iterative Distance Approximation Approximation Iterative Distance Squared Euclidean Distance Approximation Calculation

FIG. 12 is a flow diagram depicting an example method for calculating a log likelihood ratio for a bit of interest. At 220, parameters of the received signal are determined, such as a determination of coordinates that are representative of the received signal. At 222, distances are calculated between the received signal and 0-bit and 1-bit candidates. The distances are calculated in a streamlined fashion using distance estimates. At 224, closest 0-bit and 1-bit candidates are selected based on the distance metrics. Distances are determined at 226 between the received signal and the selected 0-bit and 1-bit candidates. The distances may be determined using the same algorithm as the estimates determined at 222, a different algorithm may be used to generate estimates, or an exact distance calculate may be computed. At 228, the determined distances are used to generate a log likelihood ratio for use in determining whether a bit of interest is a 0 or 1.

FIGS. 13A, 13B, and 13C depict examples of systems for use in implementing a maximum likelihood receiver. For example, FIG. 13A depicts an example of a system 300 that includes a standalone computer architecture where a processing system 302 (e.g., one or more computer processors) includes a maximum likelihood receiver 304 being executed on it. The processing system 302 has access to a computer-readable memory 306 in addition to one or more data stores 308. The one or more data stores 308 may include received signal data 310 as well as symbol candidate data 312.

FIG. 13B depicts a system 320 that includes a client server architecture. One or more user PCs 322 access one or more servers 324 running a maximum likelihood receiver 326 on a processing system 327 via one or more networks 328. The one or more servers 324 may access a computer readable memory 330 as well as one or more data stores 332. The one or more data stores 332 may contain received signal data 334 as well as symbol candidate data 336.

FIG. 13C shows a block diagram of an example of hardware for a standalone computer architecture 350, such as the architecture depicted in FIG. 13A that may be used to contain and/or implement the program instructions of system embodiments of the present invention. A bus 352 may connect the other illustrated components of the hardware. A processing system 354 labeled CPU (central processing unit) (e.g., one or more computer processors), may perform calculations and logic operations required to execute a program. A processor-readable storage medium, such as read only memory (ROM) 356 and random access memory (RAM) 358, may be in communication with the processing system 354 and may contain one or more programming instructions for performing the method of implementing a maximum likelihood receiver. Optionally, program instructions may be stored on a computer readable storage medium such as a magnetic disk, optical disk, recordable memory device, flash memory, or other physical storage medium.

A disk controller 360 interfaces one or more optional disk drives to the system bus 352. These disk drives may be external or internal floppy disk drives such as 362, external or internal CD-ROM, CD-R, CD-RW or DVD drives such as 364, or external or internal hard drives 366. As indicated previously, these various disk drives and disk controllers are optional devices.

Each of the element managers, real-time data buffer, conveyors, file input processor, database index shared access memory loader, reference data buffer and data managers may include a software application stored in one or more of the disk drives connected to the disk controller 360, the ROM 356 and/or the RAM 358. Preferably, the processor 354 may access each component as required.

A display interface 368 may permit information from the bus 352 to be displayed on a display 370 in audio, graphic, or alphanumeric format. Communication with external devices may optionally occur using various communication ports 372.

In addition to the standard computer-type components, the hardware may also include data input devices, such as a keyboard 373, or other input device 374, such as a microphone, remote control, pointer, mouse and/or joystick.

This written description uses examples to disclose the invention, including the best mode, and also to enable a person skilled in the art to make and use the invention. The patentable scope of the invention may include other examples. Additionally, the methods and systems described herein may be implemented on many different types of processing devices by program code comprising program instructions that are executable by the device processing subsystem. The software program instructions may include source code, object code, machine code, or any other stored data that is operable to cause a processing system to perform the methods and operations described herein. Other implementations may also be used, however, such as firmware or even appropriately designed hardware configured to carry out the methods and systems described herein.

The systems' and methods' data (e.g., associations, mappings, data input, data output, intermediate data results, final data results, etc.) may be stored and implemented in one or more different types of computer-implemented data stores, such as different types of storage devices and programming constructs (e.g., RAM, ROM, Flash memory, flat files, databases, programming data structures, programming variables, IF-THEN (or similar type) statement constructs, etc.). It is noted that data structures describe formats for use in organizing and storing data in databases, programs, memory, or other computer-readable media for use by a computer program.

The computer components, software modules, functions, data stores and data structures described herein may be connected directly or indirectly to each other in order to allow the flow of data needed for their operations. It is also noted that a module or processor includes but is not limited to a unit of code that performs a software operation, and can be implemented for example as a subroutine unit of code, or as a software function unit of code, or as an object (as in an object-oriented paradigm), or as an applet, or in a computer script language, or as another type of computer code. The software components and/or functionality may be located on a single computer or distributed across multiple computers depending upon the situation at hand.

It should be understood that as used in the description herein and throughout the claims that follow, the meaning of “a,” “an,” and “the” includes plural reference unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise. Finally, as used in the description herein and throughout the claims that follow, the meanings of “and” and “or” include both the conjunctive and disjunctive and may be used interchangeably unless the context expressly dictates otherwise; the phrase “exclusive or” may be used to indicate situation where only the disjunctive meaning may apply. 

The invention claimed is:
 1. A method of determining a data value for a bit of interest in a received data signal, the method comprising: selecting a closest 0-bit symbol candidate, at the bit of interest, from a plurality of 0-bit symbol candidates using a symbol selection distance approximation; selecting a closest 1-bit symbol candidate, at the bit of interest, from a plurality of 1-bit symbol candidates using the symbol selection distance approximation; calculating a 0-bit distance and a 1-bit distance, wherein the 0-bit distance represents the distance between the received data signal and the selected closest 0-bit symbol candidate, and the 1-bit distance represents the distance between the received data signal and the selected closest 1-bit symbol candidate; calculating a log likelihood ratio for the bit of interest using i) the calculated 0-bit distance and ii) the calculated 1-bit distance; and determining the data value for the bit of interest based on the calculated log likelihood ratio; wherein locations of each of the received data signal, the plurality of 0-bit symbol candidates, and the plurality of 1-bit symbol candidates are identified by coordinates; wherein the symbol selection distance approximation, as applied to selecting the closest 0-bit symbol candidate, includes estimating first distances between the received data signal and the plurality of 0-bit symbol candidates using norm approximations of vectors from the coordinates of the received data signal to coordinates of the plurality of 0-bit symbol candidates, wherein the symbol selection distance approximation, as applied to selecting the closest 1-bit symbol candidate, includes estimating second distances between the received data signal and the plurality of 1-bit symbol candidates using norm approximations of vectors from the coordinates of the received data signal to coordinates of the plurality of 1-bit symbol candidates, wherein the vector between the coordinates of the received data signal and the coordinates of a 0-bit or 1-bit symbol candidate is represented as z_(k)=z_(kI)+jz_(kQ), wherein the norm approximation of ∥z_(k)∥ estimates ∥z_(k)∥=max{|z_(kI)|,|z_(kQ)|}+α·min{|z_(kI)|,|z_(kQ)|}, where α is 5/16, and wherein the first or second distances are calculated according to a non-iterative distance approximation according to: ∥z∥≈G(z), where ${{G(z)} = {\sum\limits_{k = 1}^{N}{g\left( z_{k} \right)}}},$ where g(z _(k))=max{|z _(kI) |,|z _(kQ)|}+α·min{|z _(kI) |,|z _(kQ) |}, k=1 . . . N.
 2. A method of determining a data value for a bit of interest in a received data signal, the method comprising: selecting a closest 0-bit symbol candidate, at the bit of interest, from a plurality of 0-bit symbol candidates using a symbol selection distance approximation; selecting a closest 1-bit symbol candidate, at the bit of interest, from a plurality of 1-bit symbol candidates using the symbol selection distance approximation; calculating a 0-bit distance and a 1-bit distance, wherein the 0-bit distance represents the distance between the received data signal and the selected closest 0-bit symbol candidate, and the 1-bit distance represents the distance between the received data signal and the selected closest 1-bit symbol candidate; calculating a log likelihood ratio for the bit of interest using i) the calculated 0-bit distance and ii) the calculated 1-bit distance; and determining the data value for the bit of interest based on the calculated log likelihood ratio; wherein locations of each of the received data signal, the plurality of 0-bit symbol candidates, and the plurality of 1-bit symbol candidates are identified by coordinates; wherein the symbol selection distance approximation, as applied to selecting the closest 0-bit symbol candidate, includes estimating first distances between the received data signal and the plurality of 0-bit symbol candidates using norm approximations of vectors from the coordinates of the received data signal to coordinates of the plurality of 0-bit symbol candidates, wherein the symbol selection distance approximation, as applied to selecting the closest 1-bit symbol candidate, includes estimating second distances between the received data signal and the plurality of 1-bit symbol candidates using norm approximations of vectors from the coordinates of the received data signal to coordinates of the plurality of 1-bit symbol candidates, wherein the vector between the coordinates of the received data signal and the coordinates of a 0-bit or 1-bit symbol candidate is represented as z_(k)=z_(kI)+jz_(kQ), wherein the norm approximation of ∥z_(k)∥ estimates ∥z_(k)∥=max{|z_(kI)|,|z_(kQ)|}+α·min{∥z_(kI)|,|z_(kQ)|}, where α is 5/16, and wherein the first or second distances are calculated according to an iterative distance approximation according to: ∥z∥≈{hacek over (G)}(z)^((N)), where {hacek over (G)}(z)⁽¹⁾ =g(z ₁), where {hacek over (G)}(z)^((k))=max{g(z _(k)),G(z)^((k−1))}+α·min{g(z _(k)),G(z)^((k−1)) }, k=2 . . . N, where g(z _(k))=max{|z _(kI) |,|z _(kQ)|}+α·min{|z _(kI) |,|z _(kQ) |}, k=1 . . . N.
 3. The method of claim 1, wherein the plurality of 0-bit symbol candidates are symbols having a 0 value for the bit of interest, and wherein the plurality of 1-bit symbol candidates are symbols having a 1 value for the bit of interest.
 4. The method of claim 1, wherein selecting a closest 0-bit symbol candidate includes: determining the first distances between the received data signal and each of the plurality of 0-bit symbol candidates, wherein the first distances are determined using the symbol selection distance approximation; and selecting one of the 0-bit symbol candidates based on the determined first distances.
 5. The method of claim 1, wherein selecting a closest 1-bit symbol candidate includes: determining the second distances between the received data signal and each of the plurality of 1-bit symbol candidates, wherein the second distances are determined using the symbol selection distance approximation; and selecting one of the 1-bit symbol candidates based on the determined second distances.
 6. The method of claim 1, wherein the 0-bit distance and the 1-bit distance are calculated using the symbol selection distance approximation.
 7. The method of claim 1, wherein the 0-bit distance and the 1-bit distance are further calculated using a second distance approximation that is different from the symbol selection distance approximation.
 8. The method of claim 1, wherein the 0-bit distance and the 1-bit distance are calculated using a squared Euclidean distance calculation.
 9. The method of claim 1, wherein the symbol selection distance approximation uses an iterative distance approximation or a non-iterative distance approximation; and wherein the 0-bit distance or the 1-bit distance are calculated using the iterative distance approximation, the non-iterative distance approximation, or a squared Euclidean distance calculation.
 10. The method of claim 9, wherein the squared Euclidean distance calculation calculates a distance for a complex vector of dimension N according to: ∥z∥ ²=Σ_(k=1) ^(N) |z _(kI)|²+Σ_(k=1) ^(N) |z _(kQ)|².
 11. The method of claim 1, wherein the first distances between the received data signal and the plurality of 0-bit symbol candidates are used to select the 0-bit symbol candidate that fulfills ${x_{0} = {\arg\;{\min\limits_{x \in {\overset{\_}{X}}_{k,j}}{{y - {Hx}}}^{2}}}},$ where y represents the received signal, H represents a channel effect, and x represents 0-bit symbol candidates having a 0 at the bit of interest; and wherein the second distances between the received data signal and the plurality of 1-bit symbol candidates are used to select the 1-bit symbol candidate that fulfills ${x_{1} = {\min\limits_{x \in X_{k,j}}{{y - {Hx}}}^{2}}},$ where x represents 1-bit symbol candidates having a 1 at the bit of interest.
 12. The method of claim 11, wherein the log likelihood ratio is calculated according to: L(b _(k) ^((i)))≈1/σ²{||y−Hx ₀||²−||y−Hx ₁||²}, where ∥y−Hx₀∥ is the 0-bit distance, |y−Hx₁∥ is the 1-bit distance, L(b_(k) ^((i))) is the log likelihood ratio for a bit of interest, and σ² is a variance of noise.
 13. The method of claim 12, wherein the bit of interest is determined to be as 0 or a 1 based on the log likelihood ratio.
 14. The method of claim 1, wherein the received data signal is a multiple input, multiple output (MIMO) signal.
 15. The method of claim 1, wherein the received data signal is a single carrier signal.
 16. The method of claim 2, wherein the plurality of 0-bit symbol candidates are symbols having a 0 value for the bit of interest, and wherein the plurality of 1-bit symbol candidates are symbols having a 1 value for the bit of interest.
 17. The method of claim 2, wherein selecting a closest 0-bit symbol candidate includes: determining the first distances between the received data signal and each of the plurality of 0-bit symbol candidates, wherein the first distances are determined using the symbol selection distance approximation; and selecting one of the 0-bit symbol candidates based on the determined first distances.
 18. The method of claim 2, wherein selecting a closest 1-bit symbol candidate includes: determining the second distances between the received data signal and each of the plurality of 1-bit symbol candidates, wherein the second distances are determined using the symbol selection distance approximation; and selecting one of the 1-bit symbol candidates based on the determined second distances.
 19. The method of claim 2, wherein the 0-bit distance and the 1-bit distance are calculated using the symbol selection distance approximation.
 20. The method of claim 2, wherein the 0-bit distance and the 1-bit distance are further calculated using a second distance approximation that is different from the symbol selection distance approximation.
 21. The method of claim 2, wherein the 0-bit distance and the 1-bit distance are calculated using a squared Euclidean distance calculation.
 22. The method of claim 2, wherein the symbol selection distance approximation uses an iterative distance approximation or a non-iterative distance approximation; and wherein the 0-bit distance or the 1-bit distance are calculated using the iterative distance approximation, the non-iterative distance approximation, or a squared Euclidean distance calculation.
 23. The method of claim 22, wherein the squared Euclidean distance calculation calculates a distance for a complex vector of dimension N according to: ∥z∥ ²=Σ_(k=1) ^(N) |z _(kI)|²+Σ_(k=1) ^(N) |z _(kQ)|².
 24. The method of claim 2, wherein the first distances between the received data signal and the plurality of 0-bit symbol candidates are used to select the 0-bit symbol candidate that fulfills ${x_{0} = {\arg\;{\min\limits_{x \in {\overset{\_}{X}}_{k,j}}{{y - {Hx}}}^{2}}}},$ where y represents the received signal, H represents a channel effect, and x represents 0-bit symbol candidates having a 0 at the bit of interest; and wherein the second distances between the received data signal and the plurality of 1-bit symbol candidates are used to select the 1-bit symbol candidate that fulfills ${x_{1} = {\min\limits_{x \in X_{k,j}}{{y - {Hx}}}^{2}}},$ where x represents 1-bit symbol candidates having a 1 at the bit of interest.
 25. The method of claim 24, wherein the log likelihood ratio is calculated according to: L(b _(k) ^((i)))≈1/σ²{||y−Hx ₀||²−||y−Hx ₁||²}, where ∥y−Hx₀∥ is the 0-bit distance, |y−Hx₁∥ is the 1-bit distance, L(b_(k) ^((i))) is the log likelihood ratio for a bit of interest, and σ² is a variance of noise.
 26. The method of claim 25, wherein the bit of interest is determined to be a 0 or a 1 based on the log likelihood ratio.
 27. The method of claim 2, wherein the received data signal is a multiple input, multiple output (MIMO) signal.
 28. The method of claim 2, wherein the received data signal is a single carrier signal. 